Inertial projected gradient method for large-scale topology optimization
نویسندگان
چکیده
Abstract We present an inertial projected gradient method for solving large-scale topology optimization problems. consider the compliance minimization problem, heat conduction problem and compliant mechanism of continua. use to efficiently treat linear constraints these Also, techniques are used accelerate convergence method. adaptive step size policy further reduce computational cost. The proposed has a global property. By numerical experiments, we show that converges fast point satisfying first-order optimality condition with high accuracy compared existing methods. low cost per iteration, is thus effective in problem.
منابع مشابه
A Nonmonotone Spectral Projected Gradient Method for Large-scale Topology Optimization Problems
An efficient gradient-based method to solve the volume constrained topology optimization problems is presented. Each iterate of this algorithm is obtained by the projection of a Barzilai-Borwein step onto the feasible set consisting of box and one linear constraints (volume constraint). To ensure the global convergence, an adaptive nonmonotone line search is performed along the direction that i...
متن کاملInexact projected gradient method for vector optimization
In this work, we propose an inexact projected gradient-like method for solving smooth constrained vector optimization problems. In the unconstrained case, we retrieve the steepest descent method introduced by Graña Drummond and Svaiter. In the constrained setting, the method we present extends the exact one proposed by Graña Drummond and Iusem, since it admits relative errors on the search dire...
متن کاملSpectral projected gradient method for stochastic optimization
We consider the Spectral Projected Gradient method for solving constrained optimization porblems with the objective function in the form of mathematical expectation. It is assumed that the feasible set is convex, closed and easy to project on. The objective function is approximated by a sequence of Sample Average Approximation functions with different sample sizes. The sample size update is bas...
متن کاملGradient Method with Dynamical Retards for Large-scale Optimization Problems
We consider a generalization of the gradient method with retards for the solution of large-scale unconstrained optimization problems. Recently, the gradient method with retards was introduced to find global minimizers of large-scale quadratic functions. The most interesting feature of this method is that it does not involve a decrease in the objective function, which allows fast local convergen...
متن کاملThe inexact projected gradient method for quasiconvex vector optimization problems
Vector optimization problems are a generalization of multiobjective optimization in which the preference order is related to an arbitrary closed and convex cone, rather than the nonnegative octant. Due to its real life applications, it is important to have practical solution approaches for computing. In this work, we consider the inexact projected gradient-like method for solving smooth constra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japan Journal of Industrial and Applied Mathematics
سال: 2023
ISSN: ['0916-7005', '1868-937X']
DOI: https://doi.org/10.1007/s13160-023-00563-0